Multi-Hypothesis based Distributed Video Coding using LDPC Codes
نویسندگان
چکیده
Conventional video coding paradigms are usually built on the assumption that a video stream will be encoded only once but decoded several times. Over the years, this has lead to the development of encoders, which use complex motion-estimation algorithms to reduce the size of the video bitstream. However in applications like distributed sensor networks, cell-phones etc. the encoder has a limited amount of resources available to it and cannot employ complex motion-estimation algorithms. Intracoded frames used in conventional video coding have low-complexity, however they need large bandwidth to be transmitted. This has led to the development of Wyner-Ziv video codecs [1] which are based on the principles of side-information based coding, first propounded in the 1970s by Slepian-Wolf and Wyner-Ziv in their seminal work [2] and [3] respectively. Wyner-Ziv video codecs perform intra-frame encoding at the transmitter, and inter-frame decoding at the receiver. This reduces the size of the intraframe considerably, at the cost of increasing complexity at the decoder. For video transmission using cell-phones this increased decoder complexity can be absorbed by the base stations. Current distributed video coding schemes achieve compression by using a single reference frame for side-information. This single reference frame could be the temporally adjacent picture frame, or on an interpolated frame constructed using temporally adjacent frames. This paper proposes a new scheme for decoding video using more than one video frame as reference. Unlike schemes which use an interpolated frame, our decoding scheme makes use of data directly from the reference frames, giving an improvement of up to 1 dB. The approach is based on the premise that, covered and uncovered region are better represented in the original side-information frames, compared to the interpolated frame. This is especially true for sequences which do not have low-motion content. Index Terms – Channel Codes, distributed source coding, multi-hypothesis.
منابع مشابه
On the Comparison of Distributed Video Coding Using Ldpc Codes on Bit Plane and Symbol Level
Many distributed video coders are implemented using sophisticated error correction codes that use soft information ( conditional probabilities) as a priori knowledge. This a priori information models the dependency behavior between the input data and side-information. In this paper we analyze both a symbol and bit plane based approach using LDPC codes. We show that a bit planebased encoder has ...
متن کاملDistributed Video Coding Using LDPC Codes for Wireless Video
Popular video coding standards like H.264 and MPEG working on the principle of motion-compensated predictive coding demand much of the computational resources at the encoder increasing its complexity. Such bulky encoders are not suitable for applications like wireless low power surveillance, multimedia sensor networks, wireless PC cameras, mobile camera phones etc. New video coding scheme based...
متن کاملSelective video encryption of a distributed coded bitstream using LDPC codes
Selective encryption is a technique that is used to minimize computational complexity or enable system functionality by only encrypting a portion of a compressed bitstream while still achieving reasonable security. For selective encryption to work, we need to rely not only on the beneficial effects of redundancy reduction, but also on the characteristics of the compression algorithm to concentr...
متن کاملOn Using Redundant Parity Check Equation for LDPCA decoding in Distributed Video Coding
In the video coding, the most significant problem is the encoding complexity. It is the distributed video coding (DVC) that the encoding complexity is decreased but the decoding complexity is increased. In the DVC, the encoding complexity is decreased by using the channel coding. Especially, LDPC(A) codes are widely used. In this paper, we introduce a new decoding method for LDPC(A) code improv...
متن کاملImproving the Rao-Nam secret key cryptosystem using regular EDF-QC-LDPC codes
This paper proposes an efficient joint secret key encryption-channel coding cryptosystem, based on regular Extended Difference Family Quasi-Cyclic Low-Density Parity-Check codes. The key length of the proposed cryptosystem decreases up to 85 percent using a new efficient compression algorithm. Cryptanalytic methods show that the improved cryptosystem has a significant security advantage over Ra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005